Minimal cover-automata for "nite languages
نویسندگان
چکیده
A cover-automaton A of a "nite language L⊆ ∗ is a "nite deterministic automaton (DFA) that accepts all words in L and possibly other words that are longer than any word in L. A minimal deterministic "nite cover automaton (DFCA) of a "nite language L usually has a smaller size than a minimal DFA that accept L. Thus, cover automata can be used to reduce the size of the representations of "nite languages in practice. In this paper, we describe an e0cient algorithm that, for a given DFA accepting a "nite language, constructs a minimal deterministic "nite cover-automaton of the language. We also give algorithms for the boolean operations on deterministic cover automata, i.e., on the "nite languages they represent. c © 2001 Elsevier Science B.V. All rights reserved.
منابع مشابه
Minimal Cover-Automata for Finite Languages
A cover-automaton A of a finite language L ⊆ Σ∗ is a finite automaton that accepts all words in L and possibly other words that are longer than any word in L. A minimal deterministic cover automaton of a finite language L usually has a smaller size than a minimal DFA that accept L. Thus, cover automata can be used to reduce the size of the representations of finite languages in practice. In thi...
متن کاملSingle letter languages accepted by alternating and probabilistic pushdown automata
We consider way k tape alternating pushdown automata k apa and way k tape alternating nite automata k afa We say that an alternating automaton accepts a language L with f n bounded maximal respectively minimal leaf size if arbitrary re spectively at least one accepting tree for any w L has no more than f jwj leaves The main results of the article are the following For way k tape alternating cou...
متن کاملOn minimal realization of IF-languages: A categorical approach
he purpose of this work is to introduce and study the concept of minimal deterministic automaton with IF-outputs which realizes the given IF-language. Among two methods for construction of such automaton presented here, one is based on Myhill-Nerode's theory while the other is based on derivatives of the given IF-language. Meanwhile, the categories of deterministic automata with IF-outputs and ...
متن کاملAn O(n2) Algorithm for Constructing Minimal Cover Automata for Finite Languages
Cover automata were introduced in [1] as an efficient representation of finite languages. In [1], an algorithm was given to transform a DFA that accepts a finite language to a minimal deterministic finite cover automaton (DFCA) with the time complexity O(n), where n is the number of states of the given DFA. In this paper, we introduce a new efficient transformation algorithm with the time compl...
متن کاملMINIMIZATION OF DETERMINISTIC FINITE AUTOMATA WITH VAGUE (FINAL) STATES AND INTUITIONISTIC FUZZY (FINAL) STATES
In this paper, relations among the membership values of gener- alized fuzzy languages such as intuitionistic fuzzy language, interval-valued fuzzy language and vague language are studied. It will aid in studying the properties of one language when the properties of another are known. Further, existence of a minimized nite automaton with vague ( final) states for any vague regular language recog...
متن کامل